Polynomial Method in Tilings
نویسندگان
چکیده
In this paper we introduce a new algebraic method in tilings. Combining this method with Hilbert’s Nullstellensatz we obtain a necessary condition for tiling n-space by translates of a cluster of cubes. Further, the polynomial method will enable us to show that if there exists a tiling of n-space by translates of a cluster V of prime size then there is a lattice tiling by V as well. Finally, we provide supporting evidence for a conjecture that each tiling by translates of a prime size cluster V is lattice if V generates n-space.
منابع مشابه
Tilings of rectangles with T-tetrominoes
We prove that any two tilings of a rectangular region by T-tetrominoes are connected by moves involving only 2 and 4 tiles. We also show that the number of such tilings is an evaluation of the Tutte polynomial. The results are extended to a more general class of regions.
متن کاملTilings from some non-irreducible, Pisot substitutions
A generating method of self-affine tilings for Pisot, unimodular, irreducible substitutions, as well as the fact that the associated substitution dynamical systems are isomorphic to rotations on the torus are established in [AI01]. The aim of this paper is to extend these facts in the case where the characteristic polynomial of a substitution is non-irreducible for a special class of substituti...
متن کاملComputing the Tutte polynomial of Archimedean tilings
We describe an algorithm to compute the Tutte polynomial of large fragments of Archimedean tilings by squares, triangles, hexagons and combinations thereof. Our algorithm improves a well known method for computing the Tutte polynomial of square lattices. We also address the problem of obtaining Tutte polynomial evaluations from the symbolic expressions generated by our algorithm, improving the ...
متن کاملMixing Time for Square Tilings
We consider tilings of Z by two types of squares. We are interested in the rate of convergence to the stationarity of a natural Markov chain defined for square tilings. The rate of convergence can be represented by the mixing time which measures the amount of time it takes the chain to be close to its stationary distribution. We prove polynomial mixing time for n× logn regions in the case of ti...
متن کاملLocal Statistics for Random Domino Tilings of the Aztec Diamond
We prove an asymptotic formula for the probability that, if one chooses a domino tiling of a large Aztec diamond according to the uniform distribution on such tilings, the tiling will contain a domino covering a given pair of adjacent lattice squares. This formula quantiies the eeect of the dia-mond's boundary conditions on the behavior of typical tilings; in addition, it yields a new proof of ...
متن کامل